منابع مشابه
Root finding with threshold circuits
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials—given by a list of coefficients in binary—can be computed to a given accuracy by a uniform TC algorithm (a uniform family of constant-depth polynomial-size threshold circuits). The basic idea is to compute the inverse function of the polynomial by a power series. We also discuss an ...
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملTR-2006007: Root-Finding with Eigen-Solving
We survey and extend the recent progress in polynomial root-finding based on reducing the problem to eigen-solving for highly structured generalized companion matrices. In particular we cover the selection of the eigen-solvers and the matrices and the resulting benefits based on exploiting matrix structure. No good estimates for global convergence of the basic eigen-solvers have been proved, bu...
متن کاملNonlinear Root Finding
There has always been a close relationship between mathematics and the sciences (astronomy, chemistry, engineering, physics, etc.). When applying mathematics to study some physical phenomenon, it is often the case that we arrive at a mathematical model (an equation or set of equations) of the phenomenon that cannot be conveniently solved with exact formulas. The following classical example from...
متن کاملRoot Finding Interpolation Attack
In this paper, we rst show that there are several equivalent keys for t + 1 chosen plaintexts if the degree of the reduced cipher is t?1. This is against the claim by Jakobsen and Knudsen. We also derive an upper bound on the number of equivalent last round keys for t + 1 chosen plaintexts. We further show an eecient method which nds all the equivalent keys by using Rabin's root nding algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.001